./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1.c --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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:17:25,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:17:25,492 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:17:25,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:17:25,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:17:25,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:17:25,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:17:25,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:17:25,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:17:25,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:17:25,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:17:25,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:17:25,561 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:17:25,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:17:25,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:17:25,564 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:17:25,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:17:25,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:17:25,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:17:25,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:17:25,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:17:25,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:17:25,567 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:17:25,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:17:25,568 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:17:25,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:17:25,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:17:25,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:17:25,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:25,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:17:25,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:17:25,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:17:25,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:17:25,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:17:25,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:17:25,575 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:17:25,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:17:25,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:17:25,576 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:17:25,576 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2023-11-06 22:17:25,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:17:25,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:17:25,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:17:25,979 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:17:25,980 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:17:25,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-11-06 22:17:29,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:29,277 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:29,278 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-11-06 22:17:29,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/52d726e7a/62250582d97b4c2eafb4bffba755ea3c/FLAG0b1b88efe [2023-11-06 22:17:29,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/52d726e7a/62250582d97b4c2eafb4bffba755ea3c [2023-11-06 22:17:29,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:29,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:29,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:29,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:29,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:29,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b28d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29, skipping insertion in model container [2023-11-06 22:17:29,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:29,843 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2023-11-06 22:17:29,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:29,872 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:29,885 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2023-11-06 22:17:29,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:29,906 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:29,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29 WrapperNode [2023-11-06 22:17:29,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:29,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:29,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:29,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:29,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,952 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-11-06 22:17:29,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:29,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:29,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:29,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:29,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:29,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:29,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:29,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:29,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (1/1) ... [2023-11-06 22:17:29,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:30,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:17:30,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:17:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:30,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:17:30,132 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:30,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:30,343 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:30,348 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:30,349 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:17:30,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:30 BoogieIcfgContainer [2023-11-06 22:17:30,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:30,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:30,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:30,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:30,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:29" (1/3) ... [2023-11-06 22:17:30,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a867dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:30, skipping insertion in model container [2023-11-06 22:17:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:29" (2/3) ... [2023-11-06 22:17:30,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a867dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:30, skipping insertion in model container [2023-11-06 22:17:30,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:30" (3/3) ... [2023-11-06 22:17:30,366 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-11-06 22:17:30,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:30,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:17:30,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:30,443 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;@6ad013de, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:30,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:17:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:17:30,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:30,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:17:30,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:30,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 890553383, now seen corresponding path program 1 times [2023-11-06 22:17:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:30,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393892004] [2023-11-06 22:17:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393892004] [2023-11-06 22:17:30,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393892004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:30,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730128023] [2023-11-06 22:17:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:30,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:17:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:17:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:30,696 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:30,732 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-11-06 22:17:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:17:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2023-11-06 22:17:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:30,742 INFO L225 Difference]: With dead ends: 26 [2023-11-06 22:17:30,742 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:17:30,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:30,749 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:30,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:17:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:17:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-11-06 22:17:30,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 6 [2023-11-06 22:17:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:30,782 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-11-06 22:17:30,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2023-11-06 22:17:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:17:30,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:30,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:17:30,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:17:30,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:30,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 889659653, now seen corresponding path program 1 times [2023-11-06 22:17:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918551988] [2023-11-06 22:17:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918551988] [2023-11-06 22:17:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918551988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132001022] [2023-11-06 22:17:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:30,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:30,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:30,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:30,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:30,927 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:30,951 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-06 22:17:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-11-06 22:17:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:30,953 INFO L225 Difference]: With dead ends: 34 [2023-11-06 22:17:30,954 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 22:17:30,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:30,956 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:30,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 22:17:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2023-11-06 22:17:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-11-06 22:17:30,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2023-11-06 22:17:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:30,964 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-11-06 22:17:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-11-06 22:17:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:17:30,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:30,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:30,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:17:30,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:30,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash 314206523, now seen corresponding path program 1 times [2023-11-06 22:17:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:30,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633026173] [2023-11-06 22:17:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633026173] [2023-11-06 22:17:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633026173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406407755] [2023-11-06 22:17:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:31,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:31,211 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:31,240 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-11-06 22:17:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:17:31,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2023-11-06 22:17:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:31,243 INFO L225 Difference]: With dead ends: 31 [2023-11-06 22:17:31,243 INFO L226 Difference]: Without dead ends: 19 [2023-11-06 22:17:31,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:31,245 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-06 22:17:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-11-06 22:17:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-06 22:17:31,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2023-11-06 22:17:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:31,253 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-06 22:17:31,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-06 22:17:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:17:31,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:31,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:17:31,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:31,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 371464825, now seen corresponding path program 1 times [2023-11-06 22:17:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:31,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222180018] [2023-11-06 22:17:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:31,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222180018] [2023-11-06 22:17:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222180018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:31,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:17:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449483084] [2023-11-06 22:17:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:31,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:17:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:17:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:17:31,609 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:31,679 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-11-06 22:17:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:17:31,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2023-11-06 22:17:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:31,683 INFO L225 Difference]: With dead ends: 38 [2023-11-06 22:17:31,685 INFO L226 Difference]: Without dead ends: 24 [2023-11-06 22:17:31,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 22:17:31,687 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:31,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:17:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-06 22:17:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-11-06 22:17:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-06 22:17:31,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-11-06 22:17:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:31,702 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-06 22:17:31,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-06 22:17:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:17:31,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:31,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:31,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:17:31,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:31,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -112252653, now seen corresponding path program 1 times [2023-11-06 22:17:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151894329] [2023-11-06 22:17:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151894329] [2023-11-06 22:17:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151894329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:17:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973155946] [2023-11-06 22:17:31,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:31,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:31,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:31,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:17:31,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:17:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:31,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:17:31,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:32,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973155946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:17:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-06 22:17:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999034183] [2023-11-06 22:17:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:32,014 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:32,040 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-11-06 22:17:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:17:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2023-11-06 22:17:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:32,042 INFO L225 Difference]: With dead ends: 51 [2023-11-06 22:17:32,042 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:17:32,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:32,044 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:32,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:17:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-11-06 22:17:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-11-06 22:17:32,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 14 [2023-11-06 22:17:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:32,052 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-11-06 22:17:32,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-11-06 22:17:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:17:32,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:32,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:32,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:32,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:32,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:32,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 287729897, now seen corresponding path program 1 times [2023-11-06 22:17:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618542356] [2023-11-06 22:17:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618542356] [2023-11-06 22:17:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618542356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:17:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170543956] [2023-11-06 22:17:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:32,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:32,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:32,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:17:32,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:17:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:32,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:17:32,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:32,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:17:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:32,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170543956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:17:32,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:17:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2023-11-06 22:17:32,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501594534] [2023-11-06 22:17:32,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:17:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:17:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:17:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:17:32,830 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:33,073 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2023-11-06 22:17:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:17:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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) Word has length 21 [2023-11-06 22:17:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:33,078 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:17:33,078 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:17:33,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:17:33,084 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 107 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:33,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 109 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:17:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:17:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-11-06 22:17:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-11-06 22:17:33,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 21 [2023-11-06 22:17:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:33,107 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-11-06 22:17:33,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-11-06 22:17:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 22:17:33,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:33,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:33,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:33,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:33,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1283031657, now seen corresponding path program 2 times [2023-11-06 22:17:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:33,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490170404] [2023-11-06 22:17:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490170404] [2023-11-06 22:17:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490170404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:17:33,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232290151] [2023-11-06 22:17:33,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:17:33,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:33,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:17:33,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:17:33,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:17:33,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:33,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:17:33,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:34,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:17:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232290151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:17:35,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:17:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 16] total 33 [2023-11-06 22:17:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322279739] [2023-11-06 22:17:35,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:17:35,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:17:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:17:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=776, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:17:35,545 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 33 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:48,278 INFO L93 Difference]: Finished difference Result 556 states and 751 transitions. [2023-11-06 22:17:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-06 22:17:48,279 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 33 states have internal predecessors, (141), 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) Word has length 49 [2023-11-06 22:17:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:48,283 INFO L225 Difference]: With dead ends: 556 [2023-11-06 22:17:48,283 INFO L226 Difference]: Without dead ends: 493 [2023-11-06 22:17:48,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2050, Invalid=5782, Unknown=0, NotChecked=0, Total=7832 [2023-11-06 22:17:48,289 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 579 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:48,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 243 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:17:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-06 22:17:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 336. [2023-11-06 22:17:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.364179104477612) internal successors, (457), 335 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2023-11-06 22:17:48,340 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 49 [2023-11-06 22:17:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:48,341 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2023-11-06 22:17:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 33 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2023-11-06 22:17:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:17:48,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:48,345 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:48,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:48,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:17:48,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:48,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 50730793, now seen corresponding path program 3 times [2023-11-06 22:17:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841134956] [2023-11-06 22:17:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:48,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:17:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:17:48,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:17:48,702 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:17:48,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:17:48,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:17:48,710 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-06 22:17:48,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:48,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:48 BoogieIcfgContainer [2023-11-06 22:17:48,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:48,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:48,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:48,786 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:48,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:30" (3/4) ... [2023-11-06 22:17:48,788 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:17:48,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:48,790 INFO L158 Benchmark]: Toolchain (without parser) took 19130.15ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 111.4MB in the beginning and 110.3MB in the end (delta: 1.1MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2023-11-06 22:17:48,791 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 157.3MB. Free memory was 131.3MB in the beginning and 131.1MB in the end (delta: 148.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:48,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.56ms. Allocated memory is still 157.3MB. Free memory was 111.2MB in the beginning and 100.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:17:48,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 98.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:48,792 INFO L158 Benchmark]: Boogie Preprocessor took 26.51ms. Allocated memory is still 157.3MB. Free memory was 98.9MB in the beginning and 97.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:48,792 INFO L158 Benchmark]: RCFGBuilder took 370.82ms. Allocated memory is still 157.3MB. Free memory was 97.7MB in the beginning and 86.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:17:48,795 INFO L158 Benchmark]: TraceAbstraction took 18430.61ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 86.2MB in the beginning and 110.3MB in the end (delta: -24.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2023-11-06 22:17:48,795 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 211.8MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:48,798 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.29ms. Allocated memory is still 157.3MB. Free memory was 131.3MB in the beginning and 131.1MB in the end (delta: 148.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.56ms. Allocated memory is still 157.3MB. Free memory was 111.2MB in the beginning and 100.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 157.3MB. Free memory was 100.7MB in the beginning and 98.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.51ms. Allocated memory is still 157.3MB. Free memory was 98.9MB in the beginning and 97.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.82ms. Allocated memory is still 157.3MB. Free memory was 97.7MB in the beginning and 86.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18430.61ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 86.2MB in the beginning and 110.3MB in the end (delta: -24.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 211.8MB. Free memory is still 110.3MB. There was no memory consumed. 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 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 VAL [c=0, x=37, y=0] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=1, c=0, x=37, y=0] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=0, i=1, x & i=1, x=37, y=0] [L33] unsigned char bit = x & i; [L34] COND TRUE, EXPR bit != (unsigned char)0 [L35] EXPR y = y + i VAL [bit=1, c=0, i=1, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=1, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=1, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=1, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=1, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=1, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=2, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=2, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=2, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=2, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=2, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=3, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=3, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=3, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=3, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=3, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=4, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=4, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=4, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=4, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=4, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=5, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=5, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=5, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=5, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=5, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=6, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=6, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=6, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=6, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=6, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=7, x=37, y=1] [L31] COND TRUE c < (unsigned char)8 VAL [c=7, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [((unsigned char)1) << c=256, c=7, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=7, i=0, x & i=0, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE, EXPR !(bit != (unsigned char)0) VAL [bit=0, c=7, i=0, x=37, y=1] [L37] EXPR c = c + ((unsigned char)1) [L31-L38] { unsigned char i = ((unsigned char)1) << c; unsigned char bit = x & i; if (bit != (unsigned char)0) { y = y + i; } c = c + ((unsigned char)1); } VAL [c=8, x=37, y=1] [L31] COND FALSE !(c < (unsigned char)8) VAL [c=8, x=37, y=1] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 729 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 793 IncrementalHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 134 mSDtfsCounter, 793 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=7, InterpolantAutomatonStates: 110, 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, 7 MinimizatonAttempts, 181 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 2352 SizeOfPredicates, 3 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 20/364 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:17:48,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:17:51,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:17:51,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:17:51,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:17:51,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:17:51,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:17:51,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:17:51,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:17:51,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:17:51,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:17:51,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:17:51,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:17:51,638 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:17:51,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:17:51,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:17:51,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:17:51,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:17:51,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:17:51,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:17:51,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:17:51,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:17:51,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:17:51,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:17:51,645 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:17:51,646 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:17:51,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:17:51,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:17:51,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:17:51,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:17:51,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:17:51,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:51,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:17:51,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:17:51,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:17:51,651 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:17:51,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:17:51,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:17:51,652 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:17:51,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:17:51,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:17:51,654 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:17:51,654 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:17:51,654 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2023-11-06 22:17:52,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:17:52,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:17:52,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:17:52,083 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:17:52,083 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:17:52,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-11-06 22:17:55,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:55,501 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:55,502 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-11-06 22:17:55,511 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/ac8b271e1/1dbbe4f501554e9eb0dd6da6a107efad/FLAGeaa931674 [2023-11-06 22:17:55,526 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/data/ac8b271e1/1dbbe4f501554e9eb0dd6da6a107efad [2023-11-06 22:17:55,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:55,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:55,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:55,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:55,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:55,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b462915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55, skipping insertion in model container [2023-11-06 22:17:55,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:55,724 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2023-11-06 22:17:55,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:55,761 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:55,778 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_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/sv-benchmarks/c/bitvector/num_conversion_1.c[673,686] [2023-11-06 22:17:55,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:55,809 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:55,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55 WrapperNode [2023-11-06 22:17:55,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:55,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:55,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:55,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:55,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,846 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-11-06 22:17:55,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:55,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:55,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:55,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:55,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:55,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:55,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:55,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:55,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (1/1) ... [2023-11-06 22:17:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:55,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:17:55,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:17:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:17:56,022 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:56,025 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:56,240 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:56,247 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:56,257 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:17:56,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56 BoogieIcfgContainer [2023-11-06 22:17:56,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:56,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:56,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:56,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:56,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:55" (1/3) ... [2023-11-06 22:17:56,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2b2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:56, skipping insertion in model container [2023-11-06 22:17:56,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:55" (2/3) ... [2023-11-06 22:17:56,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2b2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:56, skipping insertion in model container [2023-11-06 22:17:56,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56" (3/3) ... [2023-11-06 22:17:56,277 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-11-06 22:17:56,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:56,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:17:56,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:56,379 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;@1aa0642, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:56,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:17:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:17:56,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:56,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:17:56,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:56,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-11-06 22:17:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:56,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602752616] [2023-11-06 22:17:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:56,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:56,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:17:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:56,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:17:56,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:56,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:56,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602752616] [2023-11-06 22:17:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602752616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636686207] [2023-11-06 22:17:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:17:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:17:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:56,622 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:56,636 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-11-06 22:17:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:17:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2023-11-06 22:17:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:56,647 INFO L225 Difference]: With dead ends: 21 [2023-11-06 22:17:56,647 INFO L226 Difference]: Without dead ends: 9 [2023-11-06 22:17:56,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:56,654 INFO L413 NwaCegarLoop]: 14 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, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:56,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-06 22:17:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-06 22:17:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-11-06 22:17:56,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-11-06 22:17:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:56,691 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-06 22:17:56,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-11-06 22:17:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:17:56,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:56,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:17:56,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:56,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:56,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:56,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-11-06 22:17:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:56,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857598100] [2023-11-06 22:17:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:56,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:56,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:56,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:56,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:17:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:56,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:17:56,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:57,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:57,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857598100] [2023-11-06 22:17:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857598100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:17:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890140848] [2023-11-06 22:17:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:17:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:17:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:57,022 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:57,055 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-11-06 22:17:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:17:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-11-06 22:17:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:57,057 INFO L225 Difference]: With dead ends: 16 [2023-11-06 22:17:57,057 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 22:17:57,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:17:57,059 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:57,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 22:17:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-11-06 22:17:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-06 22:17:57,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-11-06 22:17:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:57,070 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-06 22:17:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-06 22:17:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:17:57,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:57,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:57,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:57,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:57,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:57,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-11-06 22:17:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:57,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648535278] [2023-11-06 22:17:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:57,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:57,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:57,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:57,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:17:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:57,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:17:57,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:57,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:17:57,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648535278] [2023-11-06 22:17:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648535278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:57,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:17:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478065286] [2023-11-06 22:17:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:17:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:17:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:17:57,457 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:57,497 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2023-11-06 22:17:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:17:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-11-06 22:17:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:57,499 INFO L225 Difference]: With dead ends: 19 [2023-11-06 22:17:57,499 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 22:17:57,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 22:17:57,501 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:57,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 22:17:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-11-06 22:17:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-11-06 22:17:57,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-11-06 22:17:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:57,506 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-11-06 22:17:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-11-06 22:17:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:17:57,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:57,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:57,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:57,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:57,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:57,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2023-11-06 22:17:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108033278] [2023-11-06 22:17:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:57,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:57,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:57,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:17:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:57,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:17:57,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:57,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:17:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:57,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108033278] [2023-11-06 22:17:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108033278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:17:57,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:17:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-06 22:17:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798172506] [2023-11-06 22:17:57,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:17:57,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:57,852 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:57,900 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-11-06 22:17:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:17:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 9 [2023-11-06 22:17:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:57,901 INFO L225 Difference]: With dead ends: 23 [2023-11-06 22:17:57,902 INFO L226 Difference]: Without dead ends: 19 [2023-11-06 22:17:57,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:17:57,903 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:57,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-06 22:17:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-06 22:17:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-06 22:17:57,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-11-06 22:17:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:57,920 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-06 22:17:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-06 22:17:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:17:57,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:57,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:57,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:58,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:58,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2023-11-06 22:17:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260474451] [2023-11-06 22:17:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:58,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:58,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:58,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:17:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:58,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:17:58,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:17:58,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:17:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:17:58,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260474451] [2023-11-06 22:17:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260474451] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:17:58,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:17:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 22:17:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259742669] [2023-11-06 22:17:58,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:17:58,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:17:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:17:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:17:58,566 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:58,854 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2023-11-06 22:17:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:17:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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) Word has length 18 [2023-11-06 22:17:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:58,856 INFO L225 Difference]: With dead ends: 44 [2023-11-06 22:17:58,856 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:17:58,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:17:58,858 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:58,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 35 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:17:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:17:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2023-11-06 22:17:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-11-06 22:17:58,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2023-11-06 22:17:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:58,868 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-11-06 22:17:58,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-11-06 22:17:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:17:58,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:58,869 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:58,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:59,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:59,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:59,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2023-11-06 22:17:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:59,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200001866] [2023-11-06 22:17:59,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:17:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:59,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:59,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:59,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:17:59,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:17:59,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:59,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:17:59,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:17:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:59,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:17:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:17:59,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:17:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200001866] [2023-11-06 22:17:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200001866] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:17:59,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:17:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-06 22:17:59,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791567731] [2023-11-06 22:17:59,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:17:59,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:17:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:17:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:17:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:17:59,337 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:59,458 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-06 22:17:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:17:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) Word has length 18 [2023-11-06 22:17:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:59,460 INFO L225 Difference]: With dead ends: 35 [2023-11-06 22:17:59,460 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:17:59,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:17:59,462 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:59,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 72 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:17:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:17:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-06 22:17:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-06 22:17:59,470 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2023-11-06 22:17:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:59,471 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-06 22:17:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:17:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-06 22:17:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:17:59,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:59,473 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:59,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:17:59,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:59,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:59,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2023-11-06 22:17:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:17:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660593923] [2023-11-06 22:17:59,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:17:59,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:17:59,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:17:59,692 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:17:59,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:17:59,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-11-06 22:17:59,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:17:59,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:17:59,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:18:00,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:18:02,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660593923] [2023-11-06 22:18:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660593923] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:02,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:18:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-11-06 22:18:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50045707] [2023-11-06 22:18:02,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:02,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 22:18:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:02,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:18:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2023-11-06 22:18:02,718 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:05,311 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-11-06 22:18:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:18:05,312 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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) Word has length 30 [2023-11-06 22:18:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:05,313 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:18:05,313 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:18:05,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2023-11-06 22:18:05,316 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:05,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 156 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:18:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:18:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2023-11-06 22:18:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-06 22:18:05,331 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2023-11-06 22:18:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:05,331 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-06 22:18:05,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-06 22:18:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:18:05,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:05,333 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:05,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:05,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:05,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:18:05,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2023-11-06 22:18:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886778378] [2023-11-06 22:18:05,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:18:05,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:05,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:05,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:18:05,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:18:05,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:05,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:18:05,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:05,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:06,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886778378] [2023-11-06 22:18:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886778378] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:06,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:18:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-11-06 22:18:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778022218] [2023-11-06 22:18:06,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:06,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:18:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:18:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:18:06,279 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:08,128 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2023-11-06 22:18:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 22:18:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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) Word has length 30 [2023-11-06 22:18:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:08,130 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:18:08,131 INFO L226 Difference]: Without dead ends: 82 [2023-11-06 22:18:08,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:18:08,133 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:08,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 66 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:18:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-06 22:18:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2023-11-06 22:18:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-11-06 22:18:08,150 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2023-11-06 22:18:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:08,151 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-11-06 22:18:08,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-11-06 22:18:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:18:08,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:18:08,152 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:18:08,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:18:08,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:08,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:18:08,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:18:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2023-11-06 22:18:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:18:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664850300] [2023-11-06 22:18:08,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:18:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:08,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:18:08,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:18:08,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:18:08,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-06 22:18:08,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:18:08,395 WARN L260 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:18:08,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:18:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 58 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:10,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:18:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:18:13,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:18:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664850300] [2023-11-06 22:18:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664850300] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:18:13,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:18:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2023-11-06 22:18:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011782859] [2023-11-06 22:18:13,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:18:13,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-06 22:18:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:18:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-06 22:18:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2023-11-06 22:18:13,030 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:18:17,305 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-06 22:18:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:18:17,306 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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) Word has length 33 [2023-11-06 22:18:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:18:17,306 INFO L225 Difference]: With dead ends: 56 [2023-11-06 22:18:17,306 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:18:17,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1002, Invalid=3288, Unknown=0, NotChecked=0, Total=4290 [2023-11-06 22:18:17,309 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:18:17,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:18:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:18:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:18:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:18:17,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-11-06 22:18:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:18:17,312 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:18:17,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:18:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:18:17,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:18:17,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:18:17,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-06 22:18:17,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:18:17,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:18:18,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:18:18,303 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse2 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and (exists ((|v_ULTIMATE.start_main_~c~0#1_30| (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_30|))) (and (= (_ bv6 8) ((_ extract 7 0) (bvadd (_ bv1 32) .cse0))) (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse0))) (_ bv5 32))))))) (= (_ bv6 8) |ULTIMATE.start_main_~c~0#1|) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse1 .cse2) (and .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv4 8)) .cse1) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv3 8)) .cse3 .cse1) (and (exists ((|v_ULTIMATE.start_main_~c~0#1_59| (_ BitVec 8)) (v_subst_8 (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_59|))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))) (_ bv1 32))))))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse8))))) (let ((.cse4 ((_ zero_extend 24) v_subst_8)) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse5)))))) (_ bv0 32))) (bvslt .cse6 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7)))))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse8)))))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse9))))))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))) (bvslt .cse10 (_ bv8 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_30| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_30|))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse12))) (_ bv1 32)))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse11 (_ bv1 32)))) (bvslt .cse11 (_ bv8 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12))) (_ bv5 32)))))))) .cse1) (and (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv7 8)) .cse1 (exists ((|v_ULTIMATE.start_main_~c~0#1_30| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_30|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse13))) (_ bv1 32))) (_ bv7 8)) (= |ULTIMATE.start_main_~y~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13))) (_ bv5 32)))))))) (and .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv5 8)) .cse1))) [2023-11-06 22:18:18,304 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2023-11-06 22:18:18,305 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-11-06 22:18:18,305 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2023-11-06 22:18:18,305 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:18:18,305 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 42) the Hoare annotation is: true [2023-11-06 22:18:18,305 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2023-11-06 22:18:18,305 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2023-11-06 22:18:18,306 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:18:18,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:18:18,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-11-06 22:18:18,306 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-11-06 22:18:18,311 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-11-06 22:18:18,315 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:18:18,340 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,344 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated [2023-11-06 22:18:18,345 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,358 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated [2023-11-06 22:18:18,358 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,359 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:18 BoogieIcfgContainer [2023-11-06 22:18:18,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:18:18,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:18:18,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:18:18,363 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:18:18,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:56" (3/4) ... [2023-11-06 22:18:18,366 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:18:18,376 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:18:18,376 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:18:18,376 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:18:18,376 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:18:18,447 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:18:18,447 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:18:18,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:18:18,448 INFO L158 Benchmark]: Toolchain (without parser) took 22917.22ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 83.5MB in the beginning and 64.8MB in the end (delta: 18.7MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,448 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:18,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.50ms. Allocated memory is still 107.0MB. Free memory was 83.5MB in the beginning and 72.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 107.0MB. Free memory was 72.3MB in the beginning and 70.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,450 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 69.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:18:18,450 INFO L158 Benchmark]: RCFGBuilder took 384.78ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 60.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,450 INFO L158 Benchmark]: TraceAbstraction took 22098.53ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 59.7MB in the beginning and 68.0MB in the end (delta: -8.2MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,451 INFO L158 Benchmark]: Witness Printer took 85.56ms. Allocated memory is still 188.7MB. Free memory was 68.0MB in the beginning and 64.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:18:18,453 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.28ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.50ms. Allocated memory is still 107.0MB. Free memory was 83.5MB in the beginning and 72.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 107.0MB. Free memory was 72.3MB in the beginning and 70.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 69.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 384.78ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 60.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22098.53ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 59.7MB in the beginning and 68.0MB in the end (delta: -8.2MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. * Witness Printer took 85.56ms. Allocated memory is still 188.7MB. Free memory was 68.0MB in the beginning and 64.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated * 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: 16]: 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 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 77 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 128, 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, 9 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 348 HoareAnnotationTreeSize, 3 FomulaSimplifications, 799 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1157 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 49 QuantifiedInterpolants, 6355 SizeOfPredicates, 30 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 202/693 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant [2023-11-06 22:18:18,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,476 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated [2023-11-06 22:18:18,476 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,477 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,478 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: 6bv8 == ~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0] && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_59 : bv8, v_subst_8 : bv8 :: (((((!(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32) && ~bvslt~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 8bv32)) && ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32) && !(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]) == 0bv32)) && 0bv32 == ~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_subst_8), ~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]))[7:0]))[7:0])) && ~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_59), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) could not be translated [2023-11-06 22:18:18,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: (~c~0 == ~bvadd~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 1bv32)[7:0] && ~bvslt~32(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0]), 8bv32)) && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated [2023-11-06 22:18:18,482 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~c~0#1_30 : bv8 :: ~bvadd~32(~zero_extend~32~8(~bvadd~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 1bv32)[7:0] == 7bv8 && ~y~0 == ~bvadd~32(~zero_extend~32~8(~bvshl~32(1bv32, ~zero_extend~32~8(v_ULTIMATE.start_main_~c~0#1_30))[7:0]), 5bv32)[7:0]) could not be translated Derived loop invariant: ((((((((((6 == c) && (x == 37)) || (((c == 2) && (x == 37)) && (1 == y))) || (((y == 5) && (c == 4)) && (x == 37))) || (((1 == c) && (x == 37)) && (1 == y))) || (((c == 3) && (y == 5)) && (x == 37))) || (x == 37)) || (((y == 0) && (c == 0)) && (x == 37))) || ((c == 7) && (x == 37))) || (((y == 5) && (c == 5)) && (x == 37))) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 22:18:18,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d28bc4d-0b3c-422d-87c3-d45aa45b687b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE