./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:37,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:37,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:22:37,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:37,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:37,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:37,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:37,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:37,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:37,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:37,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:37,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:37,900 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:37,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:37,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:22:37,903 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:22:37,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:22:37,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:22:37,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:37,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:22:37,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:37,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:22:37,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:22:37,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:22:37,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:37,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:37,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:37,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:37,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:37,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:37,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:37,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:22:37,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:22:37,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:22:37,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:37,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:22:37,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:37,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:37,917 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:37,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 [2023-11-06 22:22:38,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:38,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:38,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:38,339 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:38,339 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:38,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-06 22:22:41,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:41,939 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:41,940 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-06 22:22:41,951 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/data/26b1a203f/e960a950fd9e47b782c2b48cf046de11/FLAGc0843b25a [2023-11-06 22:22:41,968 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/data/26b1a203f/e960a950fd9e47b782c2b48cf046de11 [2023-11-06 22:22:41,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:41,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:41,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:41,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:41,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:41,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:41" (1/1) ... [2023-11-06 22:22:41,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547a6fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:41, skipping insertion in model container [2023-11-06 22:22:41,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:41" (1/1) ... [2023-11-06 22:22:42,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:42,231 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2023-11-06 22:22:42,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:42,289 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:42,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2023-11-06 22:22:42,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:42,350 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:42,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42 WrapperNode [2023-11-06 22:22:42,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:42,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:42,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:42,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:42,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,409 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-06 22:22:42,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:42,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:42,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:42,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:42,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:42,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:42,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:42,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:42,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (1/1) ... [2023-11-06 22:22:42,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:42,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:22:42,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:22:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:22:42,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:22:42,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:22:42,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:42,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:42,621 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:42,623 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:42,953 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:42,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:42,963 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:22:42,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:42 BoogieIcfgContainer [2023-11-06 22:22:42,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:42,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:42,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:42,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:42,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:41" (1/3) ... [2023-11-06 22:22:42,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eccd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:42, skipping insertion in model container [2023-11-06 22:22:42,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:42" (2/3) ... [2023-11-06 22:22:42,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eccd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:42, skipping insertion in model container [2023-11-06 22:22:42,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:42" (3/3) ... [2023-11-06 22:22:42,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-06 22:22:43,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:43,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:22:43,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:43,083 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7073a3f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:43,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:22:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:22:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:22:43,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:43,110 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:43,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:22:43,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1039288057, now seen corresponding path program 1 times [2023-11-06 22:22:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312885213] [2023-11-06 22:22:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:22:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:22:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:22:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:22:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:22:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:22:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:22:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:22:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:22:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:22:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:22:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:22:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:22:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:22:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:22:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:22:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312885213] [2023-11-06 22:22:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312885213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:43,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:43,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:22:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828400798] [2023-11-06 22:22:43,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:43,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:22:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:22:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:22:43,828 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:22:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:43,862 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2023-11-06 22:22:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:22:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2023-11-06 22:22:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:43,873 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:22:43,873 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 22:22:43,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:22:43,881 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:43,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:22:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 22:22:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 22:22:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:22:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-11-06 22:22:43,968 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 124 [2023-11-06 22:22:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-11-06 22:22:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:22:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2023-11-06 22:22:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:22:43,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:43,979 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:43,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:22:43,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:22:43,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1080942329, now seen corresponding path program 1 times [2023-11-06 22:22:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267986777] [2023-11-06 22:22:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:22:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:22:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:22:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:22:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:22:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:22:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:22:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:22:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:22:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:22:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:22:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:22:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:22:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:22:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:22:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:22:51,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267986777] [2023-11-06 22:22:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267986777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:51,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:22:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861633179] [2023-11-06 22:22:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:51,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:22:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:22:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:51,655 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:22:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:53,588 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2023-11-06 22:22:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:22:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:22:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:53,594 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:22:53,595 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 22:22:53,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:22:53,598 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 133 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:53,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 576 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:22:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 22:22:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2023-11-06 22:22:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:22:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2023-11-06 22:22:53,641 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 124 [2023-11-06 22:22:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:53,642 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2023-11-06 22:22:53,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:22:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2023-11-06 22:22:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:22:53,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:53,647 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:53,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:22:53,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:22:53,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash -694065033, now seen corresponding path program 1 times [2023-11-06 22:22:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509970626] [2023-11-06 22:22:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:22:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:22:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:22:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:22:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:22:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:22:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:22:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:22:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:22:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:22:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:22:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:22:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:22:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:22:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:22:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:22:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:22:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:22:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:22:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:22:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:22:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:22:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509970626] [2023-11-06 22:22:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509970626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:22:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:22:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:22:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278552218] [2023-11-06 22:22:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:22:59,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:22:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:22:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:22:59,133 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:01,022 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2023-11-06 22:23:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:23:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:01,029 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:23:01,030 INFO L226 Difference]: Without dead ends: 191 [2023-11-06 22:23:01,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:01,033 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:01,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 493 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:23:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-06 22:23:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 82. [2023-11-06 22:23:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:23:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2023-11-06 22:23:01,095 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 124 [2023-11-06 22:23:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:01,096 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2023-11-06 22:23:01,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2023-11-06 22:23:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:23:01,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:01,100 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:01,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:01,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:01,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash -692217991, now seen corresponding path program 1 times [2023-11-06 22:23:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:01,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94708973] [2023-11-06 22:23:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:23:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:23:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:23:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:23:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:23:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:23:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:23:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:23:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:23:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:23:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:23:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:23:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94708973] [2023-11-06 22:23:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94708973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006767782] [2023-11-06 22:23:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:04,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:04,006 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:05,517 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2023-11-06 22:23:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:05,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 22:23:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:05,521 INFO L225 Difference]: With dead ends: 144 [2023-11-06 22:23:05,521 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 22:23:05,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:05,524 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 116 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:05,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 564 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:23:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 22:23:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2023-11-06 22:23:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:23:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2023-11-06 22:23:05,557 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 124 [2023-11-06 22:23:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2023-11-06 22:23:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2023-11-06 22:23:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:23:05,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:05,561 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:05,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:05,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:05,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1163479113, now seen corresponding path program 1 times [2023-11-06 22:23:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692353019] [2023-11-06 22:23:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:23:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:23:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:23:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:23:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:23:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:23:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:23:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:23:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:23:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:23:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:23:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:23:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692353019] [2023-11-06 22:23:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692353019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:23:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297422335] [2023-11-06 22:23:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:10,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:23:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:23:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:10,359 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:13,129 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2023-11-06 22:23:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:23:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:23:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:13,133 INFO L225 Difference]: With dead ends: 212 [2023-11-06 22:23:13,133 INFO L226 Difference]: Without dead ends: 210 [2023-11-06 22:23:13,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:23:13,135 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 178 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:13,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 657 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:23:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-06 22:23:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 70. [2023-11-06 22:23:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:23:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-11-06 22:23:13,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 125 [2023-11-06 22:23:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:13,172 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-11-06 22:23:13,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-11-06 22:23:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:23:13,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:13,175 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:13,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:13,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:13,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1165326155, now seen corresponding path program 1 times [2023-11-06 22:23:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013961476] [2023-11-06 22:23:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:23:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:23:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:23:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:23:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:23:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:23:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:23:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:23:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:23:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:23:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:23:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:23:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013961476] [2023-11-06 22:23:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013961476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:15,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:15,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:23:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239151200] [2023-11-06 22:23:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:15,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:23:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:23:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:15,806 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:19,324 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2023-11-06 22:23:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:23:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:23:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:19,328 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:23:19,328 INFO L226 Difference]: Without dead ends: 215 [2023-11-06 22:23:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:23:19,330 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 191 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:19,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 664 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 22:23:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-06 22:23:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 67. [2023-11-06 22:23:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:23:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-11-06 22:23:19,364 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 125 [2023-11-06 22:23:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:19,365 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-11-06 22:23:19,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-11-06 22:23:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:23:19,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:19,367 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:19,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:23:19,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:19,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 354132487, now seen corresponding path program 1 times [2023-11-06 22:23:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749764306] [2023-11-06 22:23:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:23:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:23:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:23:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:23:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:23:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:23:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:23:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:23:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:23:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:23:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:23:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:23:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749764306] [2023-11-06 22:23:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749764306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164114696] [2023-11-06 22:23:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:23,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:23,308 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:25,074 INFO L93 Difference]: Finished difference Result 146 states and 210 transitions. [2023-11-06 22:23:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 22:23:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:25,075 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:23:25,075 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:23:25,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:25,078 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 142 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:25,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 453 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:23:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:23:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:23:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:23:25,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2023-11-06 22:23:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:25,081 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:23:25,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:23:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:23:25,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:23:25,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:23:25,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:23:25,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:23:33,908 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-06 22:23:33,908 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-06 22:23:33,908 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-06 22:23:33,909 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:23:33,909 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:23:33,909 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (let ((.cse0 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse0) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse0 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 22:23:33,909 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 114 125) the Hoare annotation is: false [2023-11-06 22:23:33,910 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-06 22:23:33,910 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-06 22:23:33,910 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-06 22:23:33,910 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 22:23:33,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:23:33,910 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,911 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,911 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-06 22:23:33,911 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:23:33,911 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-11-06 22:23:33,911 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,912 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,912 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 22:23:33,912 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:23:33,912 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:23:33,912 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-06 22:23:33,912 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-06 22:23:33,912 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-11-06 22:23:33,913 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-06 22:23:33,913 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-06 22:23:33,913 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 109) no Hoare annotation was computed. [2023-11-06 22:23:33,913 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-06 22:23:33,913 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,913 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,914 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2023-11-06 22:23:33,914 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:23:33,914 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-06 22:23:33,914 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-06 22:23:33,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:23:33,914 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-06 22:23:33,915 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 110 113) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (let ((.cse19 (+ ~var_1_4~0 ~var_1_3~0)) (.cse15 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse13 (= (+ .cse15 65536 ~var_1_1~0) ~var_1_5~0)) (.cse17 (< .cse19 ~var_1_5~0)) (.cse18 (* 65536 (div .cse19 65536)))) (let ((.cse6 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0)) (.cse21 (= (+ 65536 .cse18 ~var_1_1~0) .cse19)) (.cse20 (+ .cse18 32768)) (.cse14 (or .cse13 .cse17)) (.cse9 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0))) (let ((.cse4 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse3 (not .cse9)) (.cse8 (= ~var_1_10~0 0)) (.cse0 (or (not .cse21) (and (<= .cse20 .cse19) .cse14))) (.cse10 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0)) (.cse1 (= ~var_1_10~0 1)) (.cse2 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse5 (let ((.cse31 (<= ~var_1_15~0 (+ 255 ~var_1_3~0))) (.cse30 (* (div ~var_1_3~0 65536) 65536))) (let ((.cse26 (<= ~var_1_3~0 (+ .cse30 32767))) (.cse27 (and .cse31 (= ~var_1_3~0 (+ .cse30 ~var_1_14~0)))) (.cse25 (and .cse31 (= ~var_1_3~0 (+ .cse30 65536 ~var_1_14~0)))) (.cse23 (<= (+ .cse30 32768) ~var_1_3~0)) (.cse28 (<= (+ 256 ~var_1_3~0) ~var_1_15~0)) (.cse22 (* 65536 (div (+ (- 256) ~var_1_15~0) 65536)))) (or (and (<= (+ .cse22 33024) ~var_1_15~0) (let ((.cse24 (and .cse28 (= (+ 65792 .cse22 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse23 (or .cse24 .cse25)) (and .cse26 (or .cse27 .cse24))))) (and (<= ~var_1_15~0 (+ .cse22 33023)) (let ((.cse29 (and .cse28 (= (+ .cse22 256 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse26 (or .cse29 .cse27)) (and (or .cse29 .cse25) .cse23)))))))) (.cse7 (or (let ((.cse12 (< .cse19 .cse20))) (and (or (and (or .cse12 .cse13) .cse14) (< ~var_1_5~0 (+ .cse15 32768))) (or (< (+ .cse15 32767) ~var_1_5~0) (let ((.cse16 (= (+ .cse15 ~var_1_1~0) ~var_1_5~0))) (and (or .cse16 .cse17) (or .cse12 .cse16)))) (or (= (+ .cse18 ~var_1_1~0) .cse19) (< ~var_1_5~0 (+ ~var_1_4~0 ~var_1_3~0 1))))) .cse21)) (.cse11 (not .cse6))) (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7) (and (not .cse4) .cse8 .cse2 .cse5 .cse6 .cse9) (and .cse10 .cse3 .cse8 .cse2 .cse5 .cse11) (and .cse0 (or .cse9 (not .cse10)) .cse1 .cse2 .cse5 .cse7 .cse11)))))) (let ((.cse32 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse32) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse32 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 22:23:33,916 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-06 22:23:33,916 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-06 22:23:33,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:23:33,916 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-06 22:23:33,916 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:23:33,917 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,917 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,917 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-11-06 22:23:33,917 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-06 22:23:33,917 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-11-06 22:23:33,925 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,926 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,926 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 22:23:33,926 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-06 22:23:33,926 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 22:23:33,926 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:23:33,926 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:23:33,928 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:23:33,931 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:23:33,935 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:33,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:23:34,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:34 BoogieIcfgContainer [2023-11-06 22:23:34,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:23:34,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:23:34,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:23:34,027 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:23:34,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:42" (3/4) ... [2023-11-06 22:23:34,029 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:23:34,034 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:23:34,043 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:23:34,045 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:23:34,046 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:23:34,046 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:23:34,083 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 22:23:34,118 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 22:23:34,133 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:23:34,134 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:23:34,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:23:34,135 INFO L158 Benchmark]: Toolchain (without parser) took 52161.70ms. Allocated memory was 167.8MB in the beginning and 457.2MB in the end (delta: 289.4MB). Free memory was 137.0MB in the beginning and 382.6MB in the end (delta: -245.6MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,135 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 121.6MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:34,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.35ms. Allocated memory is still 167.8MB. Free memory was 137.0MB in the beginning and 124.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.10ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 122.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,136 INFO L158 Benchmark]: Boogie Preprocessor took 38.68ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,137 INFO L158 Benchmark]: RCFGBuilder took 516.97ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 103.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,137 INFO L158 Benchmark]: TraceAbstraction took 51055.55ms. Allocated memory was 167.8MB in the beginning and 457.2MB in the end (delta: 289.4MB). Free memory was 103.6MB in the beginning and 387.8MB in the end (delta: -284.2MB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,138 INFO L158 Benchmark]: Witness Printer took 108.08ms. Allocated memory is still 457.2MB. Free memory was 387.8MB in the beginning and 382.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:23:34,140 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 121.6MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.35ms. Allocated memory is still 167.8MB. Free memory was 137.0MB in the beginning and 124.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.10ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 122.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.68ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.97ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 103.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51055.55ms. Allocated memory was 167.8MB in the beginning and 457.2MB in the end (delta: 289.4MB). Free memory was 103.6MB in the beginning and 387.8MB in the end (delta: -284.2MB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. * Witness Printer took 108.08ms. Allocated memory is still 457.2MB. Free memory was 387.8MB in the beginning and 382.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.9s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 3486 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2545 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2043 IncrementalHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 941 mSDtfsCounter, 2043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 92 PreInvPairs, 151 NumberOfFragments, 1436 HoareAnnotationTreeSize, 92 FomulaSimplifications, 3002087 FormulaSimplificationTreeSizeReduction, 6.3s HoareSimplificationTime, 25 FomulaSimplificationsInter, 17855 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 6160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5320/5320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (var_1_8 == var_1_6) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && !((cond == 0))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:23:34,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5774457-e1a3-400f-932f-f86f1be237a6/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE