./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/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_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/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_2201b487-9ed6-4630-b745-a34dd7f38158/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 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:25,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:26,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:26,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:26,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:26,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:26,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:26,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:26,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:26,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:26,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:26,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:26,086 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:26,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:26,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:26,089 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:26,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:26,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:26,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:26,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:26,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:26,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:26,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:26,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:26,095 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:26,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:26,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:26,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:26,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:26,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:26,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:26,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:26,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:26,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:26,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:26,101 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:26,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:26,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:26,117 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:26,118 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_2201b487-9ed6-4630-b745-a34dd7f38158/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_2201b487-9ed6-4630-b745-a34dd7f38158/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 -> 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b [2023-11-06 21:53:26,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:26,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:26,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:26,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:26,546 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:26,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2023-11-06 21:53:29,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:29,888 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:29,889 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2023-11-06 21:53:29,898 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/data/c738eac67/23fe4966c9ee476197dcec1d2188ca64/FLAGbcd219a9e [2023-11-06 21:53:29,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/data/c738eac67/23fe4966c9ee476197dcec1d2188ca64 [2023-11-06 21:53:29,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:29,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:29,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:29,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:29,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6de269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29, skipping insertion in model container [2023-11-06 21:53:29,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,972 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:30,141 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_2201b487-9ed6-4630-b745-a34dd7f38158/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i[915,928] [2023-11-06 21:53:30,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:30,180 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:30,194 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_2201b487-9ed6-4630-b745-a34dd7f38158/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i[915,928] [2023-11-06 21:53:30,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:30,225 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:30,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30 WrapperNode [2023-11-06 21:53:30,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:30,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:30,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:30,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:30,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,273 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-06 21:53:30,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:30,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:30,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:30,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:30,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:30,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:30,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:30,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:30,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (1/1) ... [2023-11-06 21:53:30,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:30,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:30,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:30,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:30,511 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:30,553 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:30,864 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:30,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:30,871 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:30,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30 BoogieIcfgContainer [2023-11-06 21:53:30,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:30,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:30,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:30,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:30,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:29" (1/3) ... [2023-11-06 21:53:30,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4c178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:30" (2/3) ... [2023-11-06 21:53:30,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4c178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/3) ... [2023-11-06 21:53:30,884 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-97.i [2023-11-06 21:53:30,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:30,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:30,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:30,968 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;@46d2c34e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:30,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:53:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 21:53:30,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:30,988 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:30,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:30,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1639900902, now seen corresponding path program 1 times [2023-11-06 21:53:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467533639] [2023-11-06 21:53:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:53:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467533639] [2023-11-06 21:53:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467533639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373777260] [2023-11-06 21:53:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:53:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:53:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,400 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 21:53:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,426 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2023-11-06 21:53:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:53:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2023-11-06 21:53:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:31,437 INFO L225 Difference]: With dead ends: 81 [2023-11-06 21:53:31,437 INFO L226 Difference]: Without dead ends: 40 [2023-11-06 21:53:31,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 21:53:31,445 INFO L413 NwaCegarLoop]: 56 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, 56 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 21:53:31,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-06 21:53:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-06 21:53:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 21:53:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2023-11-06 21:53:31,495 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 69 [2023-11-06 21:53:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:31,495 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2023-11-06 21:53:31,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 21:53:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2023-11-06 21:53:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 21:53:31,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:31,500 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:31,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:31,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:31,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 950368858, now seen corresponding path program 1 times [2023-11-06 21:53:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339809070] [2023-11-06 21:53:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:53:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339809070] [2023-11-06 21:53:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339809070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267554997] [2023-11-06 21:53:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:53:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:53:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:32,785 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:33,493 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2023-11-06 21:53:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2023-11-06 21:53:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:33,497 INFO L225 Difference]: With dead ends: 93 [2023-11-06 21:53:33,497 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 21:53:33,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:53:33,499 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 58 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:33,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 399 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 21:53:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2023-11-06 21:53:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 21:53:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2023-11-06 21:53:33,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 69 [2023-11-06 21:53:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:33,546 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2023-11-06 21:53:33,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2023-11-06 21:53:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 21:53:33,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:33,548 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:33,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:33,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:33,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash -768456763, now seen corresponding path program 1 times [2023-11-06 21:53:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436846205] [2023-11-06 21:53:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:53:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436846205] [2023-11-06 21:53:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436846205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995146325] [2023-11-06 21:53:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:33,712 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:33,799 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2023-11-06 21:53:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2023-11-06 21:53:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:33,803 INFO L225 Difference]: With dead ends: 128 [2023-11-06 21:53:33,804 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 21:53:33,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:33,806 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:33,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 126 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 21:53:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-11-06 21:53:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 47 states have internal predecessors, (57), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 21:53:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-11-06 21:53:33,845 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 70 [2023-11-06 21:53:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:33,846 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-11-06 21:53:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-11-06 21:53:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 21:53:33,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:33,855 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:33,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:33,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:33,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -67320123, now seen corresponding path program 1 times [2023-11-06 21:53:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665505974] [2023-11-06 21:53:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:53:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665505974] [2023-11-06 21:53:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665505974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:34,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:34,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373373025] [2023-11-06 21:53:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:34,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:34,029 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:34,104 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2023-11-06 21:53:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-11-06 21:53:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:34,109 INFO L225 Difference]: With dead ends: 119 [2023-11-06 21:53:34,110 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 21:53:34,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:34,122 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:34,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 21:53:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-11-06 21:53:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 21:53:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-11-06 21:53:34,154 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 71 [2023-11-06 21:53:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:34,157 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-11-06 21:53:34,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-11-06 21:53:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 21:53:34,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:34,162 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:34,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:34,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:34,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1703667056, now seen corresponding path program 1 times [2023-11-06 21:53:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551801569] [2023-11-06 21:53:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:53:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:53:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:53:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:53:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:53:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:53:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:53:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:53:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:53:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 21:53:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551801569] [2023-11-06 21:53:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551801569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:34,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811107573] [2023-11-06 21:53:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:34,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:53:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:53:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:34,359 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:34,462 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2023-11-06 21:53:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:53:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2023-11-06 21:53:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:34,463 INFO L225 Difference]: With dead ends: 85 [2023-11-06 21:53:34,463 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 21:53:34,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:53:34,465 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 37 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:34,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 388 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:53:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 21:53:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 21:53:34,467 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 21:53:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 21:53:34,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2023-11-06 21:53:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:34,468 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 21:53:34,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 21:53:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 21:53:34,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 21:53:34,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:53:34,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:53:34,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 21:53:35,056 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L31-2(line 31) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 61) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L31-4(line 31) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 21:53:35,058 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 21:53:35,059 INFO L902 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2023-11-06 21:53:35,061 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)))) (or (let ((.cse8 (* ~var_1_5~0 65535))) (let ((.cse12 (+ .cse8 ~var_1_4~0))) (let ((.cse10 (+ 16 .cse8)) (.cse11 (< ~var_1_4~0 16)) (.cse13 (* 65536 (div .cse12 65536)))) (let ((.cse1 (< .cse12 (+ 32768 .cse13))) (.cse2 (or .cse11 (= .cse12 (+ 65536 ~var_1_1~0 .cse13)))) (.cse5 (< (+ 32767 .cse13) .cse12)) (.cse4 (or .cse11 (= .cse12 (+ ~var_1_1~0 .cse13)))) (.cse6 (< 15 ~var_1_4~0)) (.cse7 (* 65536 (div .cse10 65536)))) (and (<= ~var_1_2~0 ~var_1_3~0) .cse0 (or (let ((.cse3 (or .cse6 (= (+ 65520 ~var_1_1~0 .cse7) .cse8)))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse5))) (< .cse8 (+ 32752 .cse7))) (or (< (+ 32751 .cse7) .cse8) (let ((.cse9 (or .cse6 (= (+ ~var_1_1~0 .cse7) .cse10)))) (and (or .cse1 (and .cse2 .cse9)) (or .cse5 (and .cse4 .cse9)))))))))) (and (= ~var_1_4~0 ~var_1_1~0) (not (= |ULTIMATE.start_property_#res#1| 0)) .cse0 (<= (+ ~var_1_3~0 1) ~var_1_2~0)))) [2023-11-06 21:53:35,061 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2023-11-06 21:53:35,061 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 66 77) the Hoare annotation is: false [2023-11-06 21:53:35,062 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-06 21:53:35,062 INFO L902 garLoopResultBuilder]: At program point L69-2(lines 69 75) the Hoare annotation is: true [2023-11-06 21:53:35,062 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 30 42) no Hoare annotation was computed. [2023-11-06 21:53:35,062 INFO L899 garLoopResultBuilder]: For program point L69-3(lines 69 75) no Hoare annotation was computed. [2023-11-06 21:53:35,062 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 21:53:35,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 21:53:35,063 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2023-11-06 21:53:35,063 INFO L902 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: true [2023-11-06 21:53:35,063 INFO L902 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: true [2023-11-06 21:53:35,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 21:53:35,063 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 21:53:35,065 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 62 65) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_property_#res#1| 0)))) (or (let ((.cse8 (* ~var_1_5~0 65535))) (let ((.cse12 (+ .cse8 ~var_1_4~0))) (let ((.cse10 (+ 16 .cse8)) (.cse11 (< ~var_1_4~0 16)) (.cse13 (* 65536 (div .cse12 65536)))) (let ((.cse1 (< .cse12 (+ 32768 .cse13))) (.cse2 (or .cse11 (= .cse12 (+ 65536 ~var_1_1~0 .cse13)))) (.cse5 (< (+ 32767 .cse13) .cse12)) (.cse4 (or .cse11 (= .cse12 (+ ~var_1_1~0 .cse13)))) (.cse6 (< 15 ~var_1_4~0)) (.cse7 (* 65536 (div .cse10 65536)))) (and (<= ~var_1_2~0 ~var_1_3~0) .cse0 (or (let ((.cse3 (or .cse6 (= (+ 65520 ~var_1_1~0 .cse7) .cse8)))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse5))) (< .cse8 (+ 32752 .cse7))) (or (< (+ 32751 .cse7) .cse8) (let ((.cse9 (or .cse6 (= (+ ~var_1_1~0 .cse7) .cse10)))) (and (or .cse1 (and .cse2 .cse9)) (or .cse5 (and .cse4 .cse9)))))))))) (and (= ~var_1_4~0 ~var_1_1~0) .cse0 (<= (+ ~var_1_3~0 1) ~var_1_2~0)))) [2023-11-06 21:53:35,065 INFO L902 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2023-11-06 21:53:35,065 INFO L902 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: true [2023-11-06 21:53:35,065 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-11-06 21:53:35,066 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 21:53:35,066 INFO L899 garLoopResultBuilder]: For program point L58(lines 43 59) no Hoare annotation was computed. [2023-11-06 21:53:35,066 INFO L902 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: true [2023-11-06 21:53:35,066 INFO L902 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: true [2023-11-06 21:53:35,066 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-11-06 21:53:35,067 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 21:53:35,067 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-06 21:53:35,067 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2023-11-06 21:53:35,067 INFO L899 garLoopResultBuilder]: For program point L63-4(line 63) no Hoare annotation was computed. [2023-11-06 21:53:35,067 INFO L899 garLoopResultBuilder]: For program point L63-6(line 63) no Hoare annotation was computed. [2023-11-06 21:53:35,068 INFO L899 garLoopResultBuilder]: For program point L63-7(line 63) no Hoare annotation was computed. [2023-11-06 21:53:35,068 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-06 21:53:35,069 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-06 21:53:35,069 INFO L902 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: true [2023-11-06 21:53:35,069 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 21:53:35,069 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 21:53:35,070 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 21:53:35,070 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 21:53:35,073 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 21:53:35,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:53:35,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:53:35 BoogieIcfgContainer [2023-11-06 21:53:35,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:53:35,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:35,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:35,127 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:35,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/4) ... [2023-11-06 21:53:35,129 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 21:53:35,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 21:53:35,144 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 21:53:35,145 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 21:53:35,146 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 21:53:35,150 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:53:35,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_2 <= var_1_3) && !((\result == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || (((var_1_4 == var_1_1) && !((\result == 0))) && ((var_1_3 + 1) <= var_1_2))) [2023-11-06 21:53:35,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_2 <= var_1_3) && !((cond == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || ((((var_1_4 == var_1_1) && !((\result == 0))) && !((cond == 0))) && ((var_1_3 + 1) <= var_1_2))) [2023-11-06 21:53:35,221 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_2 <= var_1_3) && !((\result == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || (((var_1_4 == var_1_1) && !((\result == 0))) && ((var_1_3 + 1) <= var_1_2))) [2023-11-06 21:53:35,221 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_2 <= var_1_3) && !((cond == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || ((((var_1_4 == var_1_1) && !((\result == 0))) && !((cond == 0))) && ((var_1_3 + 1) <= var_1_2))) [2023-11-06 21:53:35,231 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:53:35,231 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 21:53:35,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:35,232 INFO L158 Benchmark]: Toolchain (without parser) took 5314.04ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 129.8MB in the beginning and 113.8MB in the end (delta: 16.0MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,234 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:35,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.57ms. Allocated memory is still 159.4MB. Free memory was 129.6MB in the beginning and 121.9MB in the end (delta: 7.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.10ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,235 INFO L158 Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 118.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:35,236 INFO L158 Benchmark]: RCFGBuilder took 567.39ms. Allocated memory is still 159.4MB. Free memory was 118.5MB in the beginning and 122.7MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,236 INFO L158 Benchmark]: TraceAbstraction took 4249.98ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 121.9MB in the beginning and 118.0MB in the end (delta: 3.9MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,236 INFO L158 Benchmark]: Witness Printer took 105.39ms. Allocated memory is still 192.9MB. Free memory was 118.0MB in the beginning and 113.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:35,241 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.32ms. Allocated memory is still 130.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.57ms. Allocated memory is still 159.4MB. Free memory was 129.6MB in the beginning and 121.9MB in the end (delta: 7.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.10ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.32ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 118.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 567.39ms. Allocated memory is still 159.4MB. Free memory was 118.5MB in the beginning and 122.7MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4249.98ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 121.9MB in the beginning and 118.0MB in the end (delta: 3.9MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * Witness Printer took 105.39ms. Allocated memory is still 192.9MB. Free memory was 118.0MB in the beginning and 113.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 744 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 345 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 76 PreInvPairs, 107 NumberOfFragments, 617 HoareAnnotationTreeSize, 76 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 850 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 69]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (((((var_1_2 <= var_1_3) && !((\result == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || (((var_1_4 == var_1_1) && !((\result == 0))) && ((var_1_3 + 1) <= var_1_2))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((var_1_2 <= var_1_3) && !((cond == 0))) && ((((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535))))) && ((((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || (((65520 + var_1_1) + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (var_1_5 * 65535)))) || ((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)))) || ((var_1_5 * 65535) < (32752 + (65536 * ((16 + (var_1_5 * 65535)) / 65536)))))) && (((32751 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) < (var_1_5 * 65535)) || (((((var_1_5 * 65535) + var_1_4) < (32768 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536)))) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == ((65536 + var_1_1) + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535)))))) && (((32767 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))) < ((var_1_5 * 65535) + var_1_4)) || (((var_1_4 < 16) || (((var_1_5 * 65535) + var_1_4) == (var_1_1 + (65536 * (((var_1_5 * 65535) + var_1_4) / 65536))))) && ((15 < var_1_4) || ((var_1_1 + (65536 * ((16 + (var_1_5 * 65535)) / 65536))) == (16 + (var_1_5 * 65535))))))))) || ((((var_1_4 == var_1_1) && !((\result == 0))) && !((cond == 0))) && ((var_1_3 + 1) <= var_1_2))) RESULT: Ultimate proved your program to be correct! [2023-11-06 21:53:35,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2201b487-9ed6-4630-b745-a34dd7f38158/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE